The Verus language: representing time efficiently with BDDs
نویسندگان
چکیده
منابع مشابه
The Verus Language : Representing Time efficiently with BDDs 1
There have been significant advances on formal methods and tools to verify real-time systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the verification of industrial systems. One reasons for this is that formal methods are still difficult to apply efficiently. Another reason is that even though being more efficient than previous ones, verific...
متن کاملThe Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the verification of industrial systems. One reason for this is that formal methods are still difficult to apply efficiently. Another reason is that current verification algorithms are still not efficient enough to handle ...
متن کاملLanguage Containment Checking with Nondeterministic BDDs
Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for language containment checking between two Büchi automata. Our algorithm avoids determinization by intersecting the implementation automaton with the complement of the specification automaton as an alternating automaton. We prese...
متن کاملthe effect of task cognitive complexity and time limit on the performance of the learners with different proficiency levels in second language writing skill
this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...
15 صفحه اولOn Efficiently Representing Procedural Geometry
Procedural geometry paradigms are analyzed and classified as either “data amplifier” or “lazy evaluation.” Lazy evaluation reduces the size of the geometric representation passed to renderers and increases the flexibility of procedural experimentation. Several existing procedural geometry systems are compared in this light, and a new one is proposed, called procedural geometric instancing. Insp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00090-6